Specifying Real-Time Systems in Rewriting Logic

Specifying real-time systems in rewriting logic

This work investigates the suitability of rewriting logic as a semantic framework for modeling real time and hybrid systems We present a general method to specify and symbolically simulate such systems in rewriting logic and illustrate it with a well known benchmark We also show how a wide range of real time and hybrid system models can be naturally expressed and are uni ed within our approach ...

Specifying Real-Time Finite-State Systems in Linear Logic

Real-time nite-state systems may be speciied in linear logic by means of linear implications between conjunctions of xed nite length. In this setting, where time is treated as a dense linear ordering, safety properties may be expressed as certain provability problems. These provability problems are shown to be in pspace. They are solvable, with some guidance, by nite proof search in concurrent ...

Specifying and Verifying Aspect-Oriented Systems in Rewriting Logic

Aspect-oriented (AO) systems have to deal with an important problem which is the management of aspect interaction. In this paper, we introduce a first tool, known as AO-Maude, which is based on Maude language for the specification and the verification of the AO systems. The proposed tool relies on the reflection feature of rewriting logic that allows us to represent in the Meta-Level the struct...

Verification of Complex Real-Time Systems using Rewriting Logic

This paper presents a method for model checking dense complex real-time systems. This approach is implemented at the meta level of the Rewriting Logic system Maude. The dense complex real-time system is specified using a syntax which has the semantics of timed automata and the property is specified with the temporal logic TLTL (Timed LTL). The well known timed automata model checkers Kronos and...

Specification and Analysis of Real - Time and Hybrid Systems in Rewriting Logic